Convolutional codes II. Maximum-likelihood decoding
نویسندگان
چکیده
منابع مشابه
Convolutional Codes II. Maximum-Likelihood Decoding
Find the secret to improve the quality of life by reading this convolutional codes ii maximum likelihood decoding. This is a kind of book that you need now. Besides, it can be your favorite book to read after having this book. Do you ask why? Well, this is a book that has different characteristic with others. You may not need to know who the author is, how well-known the work is. As wise word, ...
متن کاملMaximum Likelihood Decoding of Convolutional Codes for Non-Gaussian Channels
The Viterbi algorithm plays a fundamental role in the design of receivers for digital communication systems corrupted by Gaussian noise. This algorithm arises as the maximum likelihood sequence detector of the transmitted data symbols in several applications, including equalization for channels subject to intersymbol interference, multiuser communications, and the detection of convolutionally e...
متن کاملMaximum weight basis decoding of convolutional codes
In this paper we describe a new suboptimal decoding technique for linear codes based on the calculation of maximum weight basis of the code. The idea is based on estimating the maximum number locations in a codeword which have least probability of estimation error without violating the codeword structure. In this paper we discuss the details of the algorithm for a convolutional code. The error ...
متن کاملFountain Codes under Maximum Likelihood Decoding
This dissertation focuses on fountain codes under maximum likelihood (ML) decoding. Fountain codes are a class of erasure correcting codes that can generate an endless amount of coded symbols and were conceived to deliver data files over data networks to a potentially large population of users. First Luby transform (LT) codes are considered, which represent the first class of practical fountain...
متن کاملIterative Maximum Likelihood Decoding Ofgeneralized Spacetimeblock Codes
GENERALIZED SPACE-TIME BLOCK CODES A. Lee Swindlehurst Dept. of Elec. & Comp. Engineering, Brigham Young University, Provo, UT, USA, 84602 e-mail: [email protected] ABSTRACT An iterative algorithm for ML detection of a certain class of space-time codes is presented. Codes within this general framework employ redundant linear precoding, and include as special cases many recently proposed algori...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Control
سال: 1974
ISSN: 0019-9958
DOI: 10.1016/s0019-9958(74)90870-5